Nonmanipulable Randomized Tournament Selections
نویسندگان
چکیده
Tournament solution concepts, selecting winners based on a pairwise dominance relation are an important structure often used in sports, as well as elections, and argumentation theory. Manipulation of such choice rules by coalitions of agents are a significant problem in most common rules. We deal with the problem of the manipulation of randomized choice rules by coalitions varying from a single agent, to two or more agents. We define two notions of coalitional manipulations of such choice rules based on whether or not utility is transferable. We show useful choice rules satisfying both notions of nonmanipulability, and for the transferable utility case provide bounds on the level of Condorcet consistency.
منابع مشابه
Nonmanipulable Selections from a Tournament
A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...
متن کاملRoulette-tournament Selection for Shrimp Diet Formulation Problem
This paper aims to propose a new selection procedure for real value encoding problem, specifically for shrimp diet problem. This new selection is a hybrid between two well-known selection procedure; roulette wheel selection and binary tournament selection. Shrimp diet problem is investigated to understand the hard constraints and the soft constraints involved. The comparison between other exist...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS An Approximation Algorithm for the Traveling Tournament Problem
This paper deals with the traveling tournament problem, which is a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n−1), where n is the number of teams. For the traveling tournament...
متن کاملA Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have the same probability. With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a...
متن کاملSelectivity for large nonmanipulable objects in scene-selective visual cortex does not require visual experience
The principles that determine the organization of object representations in ventral temporal cortex (VTC) remain elusive. Here, we focus on the parahippocampal place area (PPA), a region in medial VTC that has been shown to respond selectively to pictures of scenes. Recent studies further observed that this region also shows a preference for large nonmanipulable objects relative to other object...
متن کامل